On the Lattice of Cyclic Linear Codes Over Finite Chain Rings

نویسندگان

  • Alexandre Fotue Tabue
  • Christophe Mouaha
چکیده

Let R be a commutative finite chain ring of invariants (q ,s ). In this paper, the trace representation of any free cyclic R -linear code of length l, is presented, via the q -cyclotomic cosets modulo l, when gcd(l,q ) = 1. The lattice Cy(R,l);+,∩ of cyclic R -linear codes of length l, is investigated. A lower bound on the Hamming distance of cyclic R -linear codes of length l , is established. When q is even, a family of MDS and self-orthogonal R -linear cyclic codes, is constructed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Gray Image of Codes over Finite Chain Rings

The results of J. F. Qian et al. [5] on (1 − γ)-constacyclic codes over finite chain rings of nilpotency index 2 are extended to (1 − γe)constacyclic codes over finite chain rings of arbitrary nilpotency index e+1. The Gray map is introduced for this type of rings. We prove that the Gray image of a linear (1− γe)-constacyclic code over a finite chain ring is a distance-invariant quasi-cyclic co...

متن کامل

Constacyclic Codes over Group Ring (Zq[v])/G

Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...

متن کامل

Quantum Codes from Linear Codes over Finite Chain Rings

In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-ShorSteane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring Fp2m + uFp2m. The good parameter...

متن کامل

On Isodual Cyclic Codes over Finite Fields and Finite Chain Rings: Monomial Equivalence

This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given.

متن کامل

Additive cyclic codes over finite commutative chain rings

Additive cyclic codes over Galois rings were investigated in [3]. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in [3], whereas the other one has some unusual propertie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1701.08740  شماره 

صفحات  -

تاریخ انتشار 2017